package algotithm.leetcode.listnode.interview0203;

/**
 * @author zhouyanxiang
 * @Date 2021-02-2021/2/18-21:04
 * @URL https://leetcode-cn.com/problems/delete-middle-node-lcci/
 * @Title 面试题 02.03. 删除中间节点
 */

import algotithm.leetcode.listnode.ListNode;

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public void deleteNode(ListNode node) {
        node.val = node.next.val;
        node.next = node.next.next;
    }
}